Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime

Insertion and deletion (insdel for short) errors are synchronization in communication systems caused by the loss of positional information message. Reed-Solomon codes have gained a lot interest due to its encoding simplicity, well structuredness list-decoding capability classical setting. This also translates insdel metric setting, as Guruswami-Sudan decoding algorithm can be utilized provide correcting metric. Nevertheless, there been few studies on error-correcting codes. Our main contributions this article explicit constructions two families 2-dimensional with capabilities asymptotically reaching those provided Singleton bound. The first construction gives family asymptotic length. second provides an exact up Both our improve previously known whose is only logarithmic code